Parsing MELL Proof Nets 1
نویسنده
چکیده
We propose a rewriting system for parsing full multiplicative and exponential proof structures. The recognizing grammar deened by such a rewriting system (connuent and strong normalizing) gives a correctness criterion that we show equivalent to the Danos-Regnier one.
منابع مشابه
Universit a Di Pisa Parsing Mell Proof Nets Parsing Mell Proof Nets
We propose a new formulation for full (weakening and constants included) multiplicative and exponential (MELL) proof nets, allowing a complete set of rewriting rules to parse them. The recognizing grammar deened by such a rewriting system (connuent and strong normalizing on the new proof nets) gives a correctness criterion that we show equivalent to the Danos-Regnier one.
متن کاملParsing MELL proof nets
We propose a new formulation for full (weakening and constants included) multiplicative and exponential (MELL) proof nets, allowing a complete set of rewriting rules to parse them. The recognizing grammar deened by such a rewriting system (connuent and strong normalizing on the new proof nets) gives a correctness criterion that we s h o w equivalent to the Danos-Regnier one.
متن کاملThe Relational Model Is Injective for Multiplicative Exponential Linear Logic
We prove a completeness result for Multiplicative Exponential Linear Logic (MELL): we show that the relational model is injective for MELL proof-nets, i.e. the equality between MELL proof-nets in the relational model is exactly axiomatized by cut-elimination. In the seminal paper by Harvey Friedman [11], it has been shown that equality between simply-typed lambda terms in the full typed structu...
متن کاملTaylor expansion in linear logic is invertible
Each Multiplicative Exponential Linear Logic (MELL) proof-net can be expanded into a differential net, which is its Taylor expansion. We prove that two different MELL proof-nets have two different Taylor expansions. As a corollary, we prove a completeness result for MELL: We show that the relational model is injective for MELL proof-nets, i.e. the equality between MELL proof-nets in the relatio...
متن کاملProof Nets, Garbage, and Computations
We study the problem of local and asynchronous computation in the context of multiplicative exponential linear logic (MELL) proof nets. The main novelty is in a complete set of rewriting rules for cut-elimination in presence of weakening (which requires garbage collection). The proposed reduction system is strongly normalizing and confluent. Abstract: We study the problem of local and asynchron...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007